Asymptotic enumeration of orientations

نویسندگان

  • Stefan Felsner
  • Éric Fusy
  • Marc Noy
چکیده

We find the asymptotic number of 2-orientations of quadrangulations with n inner faces, and of 3orientations of triangulations with n inner vertices. We also find the asymptotic number of prime 2-orientations (no separating quadrangle) and prime 3-orientations (no separating triangle). The estimates we find are of the form c ·n−αγn, for suitable constants c, α, γ, with α = 4 for 2-orientations and α = 5 for 3-orientations. The proofs are based on singularity analysis of D-finite generating functions, using the Fuchsian theory of complex linear differential equations. Mathematics Subject Classifications (2000). 05A16, 05C10, 05C78

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A remark on asymptotic enumeration of highest weights in tensor powers of a representation

We consider the semigroup $S$ of highest weights appearing in tensor powers $V^{otimes k}$ of a finite dimensional representation $V$ of a connected reductive group. We describe the cone generated by $S$ as the cone over the weight polytope of $V$ intersected with the positive Weyl chamber. From this we get a description for the asymptotic of the number of highest weights appearing in $V^{otime...

متن کامل

On the Number of Planar Orientations with Prescribed Degrees

We deal with the asymptotic enumeration of combinatorial structures on planar maps. Prominent instances of such problems are the enumeration of spanning trees, bipartite perfect matchings, and ice models. The notion of orientations with outdegrees prescribed by a function α : V → N unifies many different combinatorial structures, including the afore mentioned. We call these orientations α-orien...

متن کامل

On the Number of α-Orientations

We deal with the enumeration of combinatorial structures on planar maps. Prominent instances of such problems are the enumeration of spanning trees, bipartite perfect matchings and ice models. The notion of an α-orientation unifies many different combinatorial structures, including the afore mentioned. We ask for the number of α-orientations and also for special instances thereof, such as Schny...

متن کامل

Enumerating Cyclic Orientations of a Graph

Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge so as to obtain a directed acyclic graph (DAG) with the same vertex set; it is cyclic otherwise. As far as we know, only the enumeration of acyclic orientations has been addressed in the literature. In this paper, we pose the prob...

متن کامل

Asymptotic Enumeration Methods

12 Large singularities of analytic functions 113 12.1 The saddle point 13 Multivariate generating functions 128 14 Mellin and other integral transforms 134 15 Functional equations, recurrences, and combinations of methods 137 15.1 Implicit functions, graphical enumeration, and related

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics & Theoretical Computer Science

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2010